#include "sort.h"

void print(int* arr, int sz) {
	for (int i = 0; i < sz; i++) {
		printf("%d ", arr[i]);
	}
	printf("\n");
}

int main()
{
	srand((unsigned int)time(NULL));
	int a[12] = { 1,9,6,4,3,6,2,8,3,2,0,4 };
	int ret = sizeof(a) / sizeof(a[0]);
	/*InsertSort(a, ret);
	printsort(a, ret);

	ShellSort(a, ret);
	printsort(a, ret);

	SelectSort(a, ret);
	printsort(a, ret);

	HeapSort(a, ret);
	printsort(a, ret);*/

	/*BubbleSort(a, ret);
	printsort(a, ret);*/
	/*PartSort3(a, 0, ret - 1);
	printsort(a, ret);*/

	//QuickSortNonR(a, 0, ret - 1);
	//printsort(a, ret);

	//MergeSort(a, ret);
	//MergeSortNonR(a, ret);

	CountSort(a, ret);
	printsort(a, ret);


	return 0;
}